The weighted random graph model

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Weighted Scale-Free Random Graph Model

Systems as diverse as genetic networks or the World Wide Web are best described as networks with complex topology. A common property of many large networks is that the vertex connectivities follow a scale-free power-law distribution. This feature was found to be a consequence of three generic mechanisms: (i) networks expand continuously by attaching addition of new vertices, (ii) new vertex wit...

متن کامل

Weighted Directed Graph-Based Authorization Delegation Model

In this paper, a new authorization delegation model is proposed, which is based on weighted directed graph to present the trust relationship between the entities and the existing issues, such as the evaluation of the trust and the presentation of the trust among the entities are addressed in simple and visual way. The model and the corresponding algorithm of the compliance checking is analyzed ...

متن کامل

Spectral reordering of a range-dependent weighted random graph

Grindrod (2002. Phys. Rev. E, 66, 0667021–0667027) posed the problem of reordering a rangedependent random graph and showed that it is relevant to the analysis of data sets from bioinformatics. Reordering under a random graph hypothesis can be regarded as an extension of clustering and fits into the general area of data mining. Here, we consider a generalization of Grindrod’s model and show how...

متن کامل

Poisson Cloning Model for Random Graph

In the random graph G(n, p) with pn bounded, the degrees of the vertices are almost i.i.d Poisson random variables with mean λ := p(n − 1). Motivated by this fact, we introduce the Poisson cloning model GPC(n, p) for random graphs in which the degrees are i.i.d Poisson random variables with mean λ. Then, we first establish a theorem that shows the new model is equivalent to the classical model ...

متن کامل

Graph Model Selection via Random Walks

In this paper, we present a novel approach based on the random walk process for finding meaningful representations of a graph model. Our approach leverages the transient behavior of many short random walks with novel initialization mechanisms to generate model discriminative features. These features are able to capture a more comprehensive structural signature of the underlying graph model. The...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: New Journal of Physics

سال: 2009

ISSN: 1367-2630

DOI: 10.1088/1367-2630/11/7/073005